SIAM Journal on Optimization -- 2005

By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

© SIAM

SIAM Journal on Optimization

Table of Contents

Available Volumes| Issue Index| View myArticles

Search This Issue

Volume 16, Issue 1, pp. 1-309

Please Note: Electronic articles are available well in advance of the printed articles.

Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence

Andreas Wächter and Lorenz T. Biegler

pp. 1-31

BibTeX Abstract Full Text: PDF

Line Search Filter Methods for Nonlinear Programming: Local Convergence

Andreas Wächter and Lorenz T. Biegler

pp. 32-48

BibTeX Abstract Full Text: PDF

A Revised Dual Projective Pivot Algorithm for Linear Programming

pp. 49-68

BibTeX Abstract Full Text: PDF

Polyhedral Risk Measures in Stochastic Programming

Andreas Eichhorn and Werner Römisch

pp. 69-95

BibTeX Abstract Full Text: PDF

Strong Lipschitz Stability of Stationary Solutions for Nonlinear Programs and Variational Inequalities

Diethard Klatte and Bernd Kummer

pp. 96-119

BibTeX Abstract Full Text: PDF

Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints

pp. 120-145

BibTeX Abstract Full Text: PDF

An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter

Claudia Sagastizábal and Mikhail Solodov

pp. 146-169

BibTeX Abstract Full Text: PDF

A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search

William W. Hager and Hongchao Zhang

pp. 170-192

BibTeX Abstract Full Text: PDF

A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems

Mihály Csaba Markót and Tibor Csendes

pp. 193-219

BibTeX Abstract Full Text: PDF

Transformation of Facets of the General Routing Problem Polytope

Gerhard Reinelt and Dirk Oliver Theis

pp. 220-234

BibTeX Abstract Full Text: PDF

Excessive Gap Technique in Nonsmooth Convex Minimization

pp. 235-249

BibTeX Abstract Full Text: PDF

A Sufficient Condition for Exact Penalty in Constrained Optimization

Alexander J. Zaslavski

pp. 250-262

BibTeX Abstract Full Text: PDF

Computing the Local-Nonglobal Minimizer of a Large Scale Trust-Region Subproblem

pp. 263-296

BibTeX Abstract Full Text: PDF

Error Estimates in the Optimization of Degree Two Polynomials on a Discrete Hypercube

pp. 297-309

BibTeX Abstract Full Text: PDF